Fast Multipoint Evaluation of Bivariate Polynomials
نویسندگان
چکیده
We show how to evaluate a bi-variate polynomial of degree n (i.e., having order n 2 many coefficients) at n generic points simultaneously within time O(n). This means an average cost of O(n) per point whereas a single evaluation provably requires in general Ω(n) operations.
منابع مشابه
Fast polynomial factorization, modular composition, and multipoint evaluation of multivariate polynomials in small characteristic
We obtain randomized algorithms for factoring degree n univariate polynomials over Fq that use O(n + n log q) field operations, when the characteristic is at most n. When log q < n, this is asymptotically faster than the best previous algorithms (von zur Gathen & Shoup (1992) and Kaltofen & Shoup (1998)); for log q ≥ n, it matches the asymptotic running time of the best known algorithms. The im...
متن کاملOn the Complexity of Real Solving of Bivariate Polynomial Systems
In this paper we present algorithmic and complexity results for polynomial sign evaluation over two real algebraic numbers, and for real solving of bivariate polynomial systems. Our main tool is signed polynomial remainder sequences; we exploit recent advances in univariate root isolation as well as multipoint evaluation techniques.
متن کاملFactoring bivariate polynomials using adjoints
We relate factorization of bivariate polynomials to singularities of projective plane curves. We prove that adjoint polynomials of a polynomial F ∈ k[x, y] with coefficients in a field k permit to recombinations of the factors of F (0, y) induced by both the absolute and rational factorizations of F , and so without using Hensel lifting. We show in such a way that a fast computation of adjoint ...
متن کاملFast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform, multiplication, division, and multipoint evaluation on encrypted polynomials. The encryption scheme we use needs to be additively homomorphic, with a plaintext domain that contains appropriate primitive roots of unity...
متن کاملHensel lifting and bivariate polynomial factorisation over finite fields
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running time is almost linear in the input size. This explains why the Hensel lifting technique is fast in practice for most polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004